Dynamic One-pile Nim
نویسندگان
چکیده
1 Introduction The purpose of this paper is to solve a class of combinatorial games consisting of one-pile counter pickup games for which the maximum number of counters that can be removed on each successive move changes during the play of the game. Two players alternate removing a positive number of counters from the pile. An ordered pair (N, x) of positive integers is called a position. The number N represents the size of the pile of counters and x represents the greatest number of counters that can be removed on the next move. A function f : Z + −→ Z + is given which determines the maximum
منابع مشابه
Pilesize Dynamic One-pile Nim and Beatty’s Theorem
In [4] we proved a generalization of Beatty’s Theorem which we stated came from the Nim value analysis of a game. In this paper we give the Nim value analysis of this game and show its relationship with Beatty’s Theorem. The game is a one-pile counter pickup game for which the maximum number of counters that can be removed on each successive move changes during the play of the game. The move si...
متن کاملDynamic One and Two Pile Nim Games Using Generalized Bases
Several authors have written papers dealing with a class of combinatorial games consisting of one-pile and two-pile counter pickup games for which the maximum number of counters that can be removed on each move changes during the play of the game. See Holshouser [8],[7], and Flanigan [4]. The maximum number of counters that can be removed can depend upon a number of factors including the number...
متن کامل2-pile Nim with a Restricted Number of Move-size Imitations
We study a variation of the combinatorial game of 2-pile Nim. Move as in 2-pile Nim but with the following constraint: Provided the previous player has just removed say x > 0 tokens from the pile with less tokens, the next player may remove x tokens from the pile with more tokens. But for each move, in “a strict sequence of previous player next player moves”, such an imitation takes place, the ...
متن کاملTwo Pile Move-Size Dynamic Nim
The purpose of this paper is to solve a special class of combinational games consisting of two-pile counter pickup games for which the maximum number of counters that can be removed on each successive move changes during the play of the games. Two players alternate moving. Each player in his turn first chooses one of the piles, and his choice of piles can change from move to move. He then remov...
متن کاملWythoff'snim and Fibonacci Representations
Our aim in what follows is to show how Fibonacci representations play a role in determining winning moves for Wythoffs Nim [1, 2] very analogous to the role of binary representations in Bouton's Nim [3 ] . The particulars of these two games can be found in the preceding references, but for the convenience of the reader, we briefly recount the rules of play. In Bouton's Nim (usually referred to ...
متن کامل